Kinesthetic Learning Based on Fast Marching Square Method for Manipulation
نویسندگان
چکیده
The advancement of robotics in recent years has driven the growth robotic applications for more complex tasks requiring manipulation capabilities. Recent works have focused on adapting learning methods to which are stochastic and may not converge. In this paper, a kinesthetic method based fast marching square is presented. This poses great advantages such as ensuring convergence from experience human demonstrator. For purpose, demonstrator teaches paths by physically guiding one UR3 arms mobile manipulator. After first phase, Learning used make robot learn experience. As novelty, an auto-learning functionality presented, provides algorithm with exploration capacity. base only using information provided taught trajectories, but also expanding its ability order explore unknown states environment. effectiveness proposed been evaluated through simulations 2D 3D environments real process analyzed other approaches LASA dataset it tested scenarios different obstacles, proving effectiveness.
منابع مشابه
Fast Marching Trees: A Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions
In this paper we present a novel probabilistic sampling-based motion planning algorithm called the Fast Marching Tree algorithm (FMT*). The algorithm is specifically aimed at solving complex motion planning problems in high-dimensional configuration spaces. This algorithm is proven to be asymptotically optimal and is shown to converge to an optimal solution faster than its state-of-the-art coun...
متن کاملFast Marching Tree: a Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions
In this paper we present a novel probabilistic sampling-based motion planning algorithm called the Fast Marching Tree algorithm (FMT∗). The algorithm is specifically aimed at solving complex motion planning problems in high-dimensional configuration spaces. This algorithm is proven to be asymptotically optimal and is shown to converge to an optimal solution faster than its state-of-the-art coun...
متن کاملAn Image Inpainting Technique Based on the Fast Marching Method
Digital inpainting provides a means for reconstruction of small damaged portions of an image. Although the inpainting basics are straightforward, most inpainting techniques published in the literature are complex to understand and implement. We present here a new algorithm for digital inpainting based on the fast marching method for level set applications. Our algorithm is very simple to implem...
متن کاملSegmentation Using Fast Marching Method
The paper deals with a novel segmentation technique applicable to colour video sequences. The algorithm uses Fast Marching Method for automatic extraction of semantic objects from natural colour video sequences by joint motion and colour analysis. The algorithm handles background in the same way as other objects, thus it does not need global motion compensation. The number of control parameters...
متن کاملPlanning robot formations with fast marching square including uncertainty conditions
This paper presents a novel algorithm to solve the robot formation path planning problem working under uncertainty conditions such as errors the in robot’s positions, errors when sensing obstacles or walls, etc. The proposed approach provides a solution based on a leader-followers architecture (real or virtual leaders) with a prescribed formation geometry that adapts dynamically to the environm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied sciences
سال: 2023
ISSN: ['2076-3417']
DOI: https://doi.org/10.3390/app13042028